Topology Sensitive Volume Mesh Simplification with Planar Quadric Error Metrics
نویسندگان
چکیده
We introduce an algorithm for fast topology-sensitive decimation of volume meshes. The algorithm employs a planar quadric error metric to guarantee minimum geometric error at every simplification step, while maintaining the input mesh's geometric consistency, and restraining changes to its topological genus, at low computational costs. The proposed method presents a new alternative to existing volume mesh decimation schemes, and lies between computationally intensive edge-collapse-based algorithms [1, 2, 3, 4], and a rapid topology-insensitive volume decimation approach [5]. The applications include, but are not limited to, rapid Level of Detail (LOD) generation, progressive volume rendering for scientific visualization applications, and representing volume meshes with minimal geometric complexity in computer games and entertainment media. CR Categories: I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling – surfaces and object representations.
منابع مشابه
GPU-Accelerated Triangle Mesh Simplification Using Parallel Vertex Removal
We present an approach to triangle mesh simplification designed to be executed on the GPU. We use a quadric error metric to calculate an error value for each vertex of the mesh and order all vertices based on this value. This step is followed by the parallel removal of a number of vertices with the lowest calculated error values. To allow for the parallel removal of multiple vertices we use a s...
متن کاملA New Mesh Simplification Algorithm Combining Half-Edge Data Structure with Modified Quadric Error Metric
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the adjacency queries between components of the mesh, such as vertices, faces and edges, can be quickly achieved and thus the run time is reduced remarkably. Furthermore, with the modified quadric error metric, the qualit...
متن کاملA memory effective two-phase approach for large scanned surface mesh simplification
We present a novel two-phase multi-attribute algorithm suitable for large surface mesh simplification. By employing a linear combination of error metrics to control the process, the proposed algorithm incorporates geometric error control and preserves other attributes of the original model such as the texture (vertex color) and surface normal. In the first phase, we utilize the volumesurface tr...
متن کاملVariational mesh segmentation via quadric surface fitting
Wepresent a new variationalmethod formesh segmentation by fitting quadric surfaces. Each component of the resulting segmentation is represented by a general quadric surface (including plane as a special case). A novel energy function is defined to evaluate the quality of the segmentation, which combines both L2 and L2,1 metrics from a triangle to a quadric surface. The Lloyd iteration is used t...
متن کامل3d Face Correspondence Based on Uniform Mesh Resampling Combined with Mesh Simplification
This present study, proposes a new 3D face correspondence method. A uniform mesh re-sampling algorithm is combined with mesh simplification algorithm to make correspondence between vertices of prototypical 3D faces. Uniform mesh re-sampling algorithm is developed to obtain the same topology between 3D faces with different structures. A global error metrics is proposed and mesh simplification is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998